package bintree.heap;

import seqlist.queue.Queue;

/**
 * @author yuisama
 * @date 2022/05/17 20:57
 **/
public class QueueTest {
    public static void main(String[] args) {
        int[] data = new int[] {3,5,7,6,2,1,9,4};
        Queue<Integer> queue = new PriorityQueue();
        for (int i : data) {
            queue.offer(i);
        }
        System.out.println(queue.poll());
    }
}